Computing Lower Bounds for Steiner Trees in Road Network Design
نویسندگان
چکیده
In the automated design of road networks an important sub-task is the solution of an instance of the Steiner tree problem, a well known N P-hard problem. In this paper we present the experimental evaluation of a heuristic for the Steiner tree problem used in the design of low volume forest road networks. To evaluate a heuristic it is necessary to compare to the optimum value or a good lower bound on the optimum. Thus, the focus of this paper is on a new approach to compute such lower bounds for the Steiner tree problem in graphs emanating from the automated road network design problem. We evaluated the heuristic on data from a mountainous region of the Swiss Alps. The algorithms and the model were developed in a collaborative project between the Institute of Theoretical Computer Science and the Chair of Land Use Engineering at ETH Zurich.
منابع مشابه
Approximations and Lower Bounds for the Length of Minimal Euclidean Steiner Trees
We give a new lower bound on the length of the minimal Steiner tree with a given topology joining given terminals in Euclidean space, in terms of toroidal images. The lower bound is equal to the length when the topology is full. We use the lower bound to prove bounds on the “error” e in the length of an approximate Steiner tree, in terms of the maximum deviation d of an interior angle of the tr...
متن کاملAn improved algorithm for computing Steiner minimal trees in Euclidean d-space
We describe improvements to Smith’s branch-and-bound (B&B) algorithm for the Euclidean Steiner problem in IR. Nodes in the B&B tree correspond to full Steiner topologies associated with a subset of the terminal nodes, and branching is accomplished by “merging” a new terminal node with each edge in the current Steiner tree. For a given topology we use a conic formulation for the problem of locat...
متن کاملA dual-ascent-based branch-and-bound framework for the prize-collecting Steiner tree and related problems
In this work we present a branch-and-bound (B&B) framework for the asymmetric prizecollecting Steiner tree problem (APCSTP). Several well-known network design problems can be transformed to the APCSTP, including the Steiner tree problem (STP), prize-collecting Steiner tree problem (PCSTP), maximum-weight connected subgraph problem (MWCS) and the nodeweighted Steiner tree problem (NWSTP). The ma...
متن کاملApproximating some network-design problems with degree constraints
We study several network design problems with degree constraints. For the degree-constrained 2 vertex-connected subgraph problem we obtain a factor 6 violation for the degrees with 4 approximation for the cost. This improves upon the logarithmic degree violation and no cost guarantee obtained by Feder, Motwani, and Zhu (2006). Then we consider the problem of finding an arborescence with at leas...
متن کاملNordhaus-Gaddum type results for the Harary index of graphs
The emph{Harary index} $H(G)$ of a connected graph $G$ is defined as $H(G)=sum_{u,vin V(G)}frac{1}{d_G(u,v)}$ where $d_G(u,v)$ is the distance between vertices $u$ and $v$ of $G$. The Steiner distance in a graph, introduced by Chartrand et al. in 1989, is a natural generalization of the concept of classical graph distance. For a connected graph $G$ of order at least $2$ ...
متن کامل